Some basic properties of fix-free codes

نویسندگان

Chunxuan Ye

Raymond W. Yeung

چکیده

a variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other codeword. This class of codes is applied to speed up the decoding process, for the decoder can decode from both sides of the compressed file simultaneously. In this paper, we study some basic properties of fix-free codes. We prove a sufficient and a necessary condition for the existence of fix-free codes, and we obtain some new upper bounds on the redundancy of optimal fix-free codes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Properties of Fix { Free Codes

A (variable length) code is x { free code if no codeword is a preex or a suux of any other. A database constructed by a x { free code is instantaneously decodeable from both sides. We discuss the existence of x { free codes, relations to the deBrujin Network and shadow problems.

متن کامل

On the construction of prefix-free and fix-free codes with specified codeword compositions

We investigate the construction of prefix-free and fix-free codes with specified codeword compositions. We present a polynomial time algorithm which constructs a fix-free code with the same codeword compositions as a given code for a special class of codes called distinct codes. We consider the construction of optimal fix-free codes which minimize the average codeword cost for general letter co...

متن کامل

-Conjecture for Fix-Free Codes

A fix-free code is a code, which is prefix-free and suffix-free, i.e. any codeword of a fix-free code is neither a prefix, nor a suffix of another codeword. Fix-free codes were first introduced by Schützenberg (4) and Gilbert and Moore (5), where they were called never-self-synchronizing codes. Ahlswede, Balkenhol and Khachatrian propose in (6) the conjecture that a Kraftsum of a lengths sequen...

متن کامل